0.04/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.15 % Command : run_E %s %d THM 0.14/0.36 % Computer : n014.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 960 0.14/0.36 % WCLimit : 120 0.14/0.36 % DateTime : Tue Aug 9 03:12:46 EDT 2022 0.14/0.36 % CPUTime : 0.21/0.52 Running higher-order on 8 cores theorem proving 0.21/0.52 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.21/0.52 # Version: 3.0pre003-ho 0.21/0.53 # Preprocessing class: HSMSSMSSSSMNSSN. 0.21/0.53 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.53 # Starting new_ho_10 with 600s (5) cores 0.21/0.53 # Starting sh5l with 120s (1) cores 0.21/0.53 # Starting ehoh_best_sine_rwall with 120s (1) cores 0.21/0.53 # Starting lpo1_def_fix with 120s (1) cores 0.21/0.53 # new_ho_10 with pid 22876 completed with status 0 0.21/0.53 # Result found by new_ho_10 0.21/0.53 # Preprocessing class: HSMSSMSSSSMNSSN. 0.21/0.53 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.53 # Starting new_ho_10 with 600s (5) cores 0.21/0.53 # No SInE strategy applied 0.21/0.53 # Search class: HGHSF-FFSF22-SSSFFSBN 0.21/0.53 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.21/0.53 # Starting ho_unfolding_3 with 325s (1) cores 0.21/0.53 # Starting new_ho_10 with 61s (1) cores 0.21/0.53 # Starting sh5l with 55s (1) cores 0.21/0.53 # Starting full_lambda_10 with 55s (1) cores 0.21/0.53 # Starting full_lambda_6 with 55s (1) cores 0.21/0.53 # full_lambda_10 with pid 22886 completed with status 0 0.21/0.53 # Result found by full_lambda_10 0.21/0.53 # Preprocessing class: HSMSSMSSSSMNSSN. 0.21/0.53 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.53 # Starting new_ho_10 with 600s (5) cores 0.21/0.53 # No SInE strategy applied 0.21/0.53 # Search class: HGHSF-FFSF22-SSSFFSBN 0.21/0.53 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.21/0.53 # Starting ho_unfolding_3 with 325s (1) cores 0.21/0.53 # Starting new_ho_10 with 61s (1) cores 0.21/0.53 # Starting sh5l with 55s (1) cores 0.21/0.53 # Starting full_lambda_10 with 55s (1) cores 0.21/0.53 # Preprocessing time : 0.001 s 0.21/0.53 # Presaturation interreduction done 0.21/0.53 0.21/0.53 # Proof found! 0.21/0.53 # SZS status Theorem 0.21/0.53 # SZS output start CNFRefutation 0.21/0.53 thf(decl_22, type, p: nat > $o). 0.21/0.53 thf(decl_23, type, some: (nat > $o) > $o). 0.21/0.53 thf(decl_24, type, lessis: nat > nat > $o). 0.21/0.53 thf(decl_25, type, more: nat > nat > $o). 0.21/0.53 thf(decl_26, type, esk1_0: nat). 0.21/0.53 thf(decl_27, type, esk2_0: nat). 0.21/0.53 thf(decl_28, type, epred1_1: (nat > $o) > nat > $o). 0.21/0.53 thf(decl_29, type, esk3_2: nat > (nat > $o) > nat). 0.21/0.53 thf(decl_30, type, esk4_0: nat). 0.21/0.53 thf(decl_31, type, esk5_0: nat). 0.21/0.53 thf(decl_32, type, esk6_0: nat). 0.21/0.53 thf(decl_33, type, esk7_0: nat). 0.21/0.53 thf(decl_34, type, esk8_0: nat). 0.21/0.53 thf(satz27a, conjecture, ~((![X1:nat, X2:nat]:(((~((~((p @ X2))<=![X4:nat]:(((p @ X4)=>(lessis @ X2 @ X4)))))=>((X1)=(X2)))<=~((~((p @ X1))<=![X4:nat]:(((p @ X4)=>(lessis @ X1 @ X4)))))))=>~((some @ (^[X1:nat]:(~((~((p @ X1))<=![X4:nat]:(((lessis @ X1 @ X4)<=(p @ X4))))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz27a)). 0.21/0.53 thf(satz27, axiom, ![X3:nat > $o]:(((some @ X3)=>(some @ (^[X1:nat]:(~((~((X3 @ X1))<=![X4:nat]:(((lessis @ X1 @ X4)<=(X3 @ X4)))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz27)). 0.21/0.53 thf(s, axiom, (some @ p), file('/export/starexec/sandbox/benchmark/theBenchmark.p', s)). 0.21/0.53 thf(satz10d, axiom, ![X1:nat, X2:nat]:((~((more @ X1 @ X2))<=(lessis @ X1 @ X2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz10d)). 0.21/0.53 thf(satz14, axiom, ![X1:nat, X2:nat]:(((lessis @ X1 @ X2)=>(((X2)=(X1))<=~((more @ X2 @ X1))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz14)). 0.21/0.53 thf(c_0_5, negated_conjecture, ~(~((![X1:nat, X2:nat]:((~((![X4:nat]:(((p @ X4)=>(lessis @ X1 @ X4)))=>~(p @ X1)))=>(~((![X4:nat]:(((p @ X4)=>(lessis @ X2 @ X4)))=>~(p @ X2)))=>((X1)=(X2)))))=>~(some @ (^[Z0:nat]:(~((~((p @ Z0))<=![X4:nat]:(((lessis @ Z0 @ X4)<=(p @ X4))))))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz27a])])])). 0.21/0.53 thf(c_0_6, plain, ![X3:nat > $o]:(((some @ X3)=>(some @ (^[Z0:nat]:(~((~((X3 @ Z0))<=![X4:nat]:(((lessis @ Z0 @ X4)<=(X3 @ X4)))))))))), inference(fof_simplification,[status(thm)],[satz27])). 0.21/0.53 thf(c_0_7, negated_conjecture, ![X21:nat, X22:nat]:((((~(p @ X21)|(lessis @ esk1_0 @ X21)|~(some @ (^[Z0:nat]:(~((~((p @ Z0))<=![X4:nat]:(((lessis @ Z0 @ X4)<=(p @ X4)))))))))&((p @ esk1_0)|~(some @ (^[Z0:nat]:(~((~((p @ Z0))<=![X4:nat]:(((lessis @ Z0 @ X4)<=(p @ X4))))))))))&(((~(p @ X22)|(lessis @ esk2_0 @ X22)|~(some @ (^[Z0:nat]:(~((~((p @ Z0))<=![X4:nat]:(((lessis @ Z0 @ X4)<=(p @ X4)))))))))&((p @ esk2_0)|~(some @ (^[Z0:nat]:(~((~((p @ Z0))<=![X4:nat]:(((lessis @ Z0 @ X4)<=(p @ X4))))))))))&(((esk1_0)!=(esk2_0))|~(some @ (^[Z0:nat]:(~((~((p @ Z0))<=![X4:nat]:(((lessis @ Z0 @ X4)<=(p @ X4)))))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])). 0.21/0.53 thf(c_0_8, plain, ![X26:nat, X3:nat > $o]:(((epred1_1 @ X3 @ X26)<=>~((~((X3 @ X26))<=![X25:nat]:(((lessis @ X26 @ X25)<=(X3 @ X25))))))), introduced(definition)). 0.21/0.53 thf(c_0_9, plain, ![X18:nat > $o]:((~(some @ X18)|(some @ (^[Z0:nat]:(~((~((X18 @ Z0))<=![X4:nat]:(((lessis @ Z0 @ X4)<=(X18 @ X4)))))))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])). 0.21/0.53 thf(c_0_10, negated_conjecture, ((p @ esk2_0)|~((((some @ (epred1_1 @ p)))=(($true))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7]), c_0_8])). 0.21/0.53 thf(c_0_11, plain, ![X3:nat > $o]:(((((some @ (epred1_1 @ X3)))=(($true)))|~((some @ X3)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9]), c_0_8])). 0.21/0.53 thf(c_0_12, plain, ![X37:nat, X38:nat > $o, X39:nat]:((((~(X38 @ X39)|(lessis @ X37 @ X39)|~(epred1_1 @ X38 @ X37))&((X38 @ X37)|~(epred1_1 @ X38 @ X37)))&(((X38 @ (esk3_2 @ X37 @ X38))|~(X38 @ X37)|(epred1_1 @ X38 @ X37))&(~(lessis @ X37 @ (esk3_2 @ X37 @ X38))|~(X38 @ X37)|(epred1_1 @ X38 @ X37))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[])])])])])])). 0.21/0.53 thf(c_0_13, negated_conjecture, ![X1:nat]:(((lessis @ esk2_0 @ X1)|~((p @ X1))|~((((some @ (epred1_1 @ p)))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7]), c_0_8])). 0.21/0.53 thf(c_0_14, negated_conjecture, ((p @ esk2_0)|~((some @ (epred1_1 @ p)))), inference(cn,[status(thm)],[c_0_10])). 0.21/0.53 thf(c_0_15, plain, ![X3:nat > $o]:(((some @ (epred1_1 @ X3))|~((some @ X3)))), inference(cn,[status(thm)],[c_0_11])). 0.21/0.53 thf(c_0_16, plain, (some @ p), inference(split_conjunct,[status(thm)],[s])). 0.21/0.53 thf(c_0_17, plain, ![X1:nat, X2:nat]:(((lessis @ X1 @ X2)=>~(more @ X1 @ X2))), inference(fof_simplification,[status(thm)],[satz10d])). 0.21/0.53 thf(c_0_18, plain, ![X1:nat, X2:nat]:(((lessis @ X1 @ X2)=>(~(more @ X2 @ X1)=>((X2)=(X1))))), inference(fof_simplification,[status(thm)],[satz14])). 0.21/0.53 thf(c_0_19, plain, ![X3:nat > $o, X1:nat]:(((epred1_1 @ X3 @ X1)|~((lessis @ X1 @ (esk3_2 @ X1 @ X3)))|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.21/0.53 thf(c_0_20, negated_conjecture, ![X1:nat]:(((lessis @ esk2_0 @ X1)|~((some @ (epred1_1 @ p)))|~((p @ X1)))), inference(cn,[status(thm)],[c_0_13])). 0.21/0.53 thf(c_0_21, plain, ![X3:nat > $o, X1:nat]:(((X3 @ (esk3_2 @ X1 @ X3))|(epred1_1 @ X3 @ X1)|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.21/0.53 thf(c_0_22, negated_conjecture, (p @ esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])])). 0.21/0.53 thf(c_0_23, plain, ![X23:nat, X24:nat]:((~(lessis @ X23 @ X24)|~(more @ X23 @ X24))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])). 0.21/0.53 thf(c_0_24, plain, ![X16:nat, X17:nat]:((~(lessis @ X16 @ X17)|((more @ X17 @ X16)|((X17)=(X16))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])). 0.21/0.53 thf(c_0_25, negated_conjecture, ![X3:nat > $o]:(((epred1_1 @ X3 @ esk2_0)|~((p @ (esk3_2 @ esk2_0 @ X3)))|~((some @ (epred1_1 @ p)))|~((X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.21/0.53 thf(c_0_26, negated_conjecture, ((p @ (esk3_2 @ esk2_0 @ p))|(epred1_1 @ p @ esk2_0)), inference(spm,[status(thm)],[c_0_21, c_0_22])). 0.21/0.53 thf(c_0_27, plain, ![X1:nat, X2:nat]:((~((lessis @ X1 @ X2))|~((more @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_23])). 0.21/0.53 thf(c_0_28, plain, ![X1:nat, X2:nat]:(((more @ X2 @ X1)|((X2)=(X1))|~((lessis @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.21/0.53 thf(c_0_29, negated_conjecture, ![X1:nat]:(((lessis @ esk1_0 @ X1)|~((p @ X1))|~((((some @ (epred1_1 @ p)))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7]), c_0_8])). 0.21/0.53 thf(c_0_30, negated_conjecture, ((epred1_1 @ p @ esk2_0)|~((some @ (epred1_1 @ p)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_22])])). 0.21/0.53 thf(c_0_31, negated_conjecture, ((p @ esk1_0)|~((((some @ (epred1_1 @ p)))=(($true))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7]), c_0_8])). 0.21/0.53 thf(c_0_32, negated_conjecture, (((esk1_0)!=(esk2_0))|~((((some @ (epred1_1 @ p)))=(($true))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7]), c_0_8])). 0.21/0.53 thf(c_0_33, plain, ![X1:nat, X2:nat]:((((X1)=(X2))|~((lessis @ X2 @ X1))|~((lessis @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_27, c_0_28])). 0.21/0.53 thf(c_0_34, negated_conjecture, ![X1:nat]:(((lessis @ esk1_0 @ X1)|~((some @ (epred1_1 @ p)))|~((p @ X1)))), inference(cn,[status(thm)],[c_0_29])). 0.21/0.53 thf(c_0_35, plain, ![X1:nat, X3:nat > $o, X2:nat]:(((lessis @ X2 @ X1)|~((X3 @ X1))|~((epred1_1 @ X3 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.21/0.53 thf(c_0_36, negated_conjecture, (epred1_1 @ p @ esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_15]), c_0_16])])). 0.21/0.53 thf(c_0_37, negated_conjecture, ((p @ esk1_0)|~((some @ (epred1_1 @ p)))), inference(cn,[status(thm)],[c_0_31])). 0.21/0.53 thf(c_0_38, negated_conjecture, (((esk2_0)!=(esk1_0))|~((some @ (epred1_1 @ p)))), inference(cn,[status(thm)],[c_0_32])). 0.21/0.53 thf(c_0_39, negated_conjecture, ![X1:nat]:((((X1)=(esk1_0))|~((some @ (epred1_1 @ p)))|~((lessis @ X1 @ esk1_0))|~((p @ X1)))), inference(spm,[status(thm)],[c_0_33, c_0_34])). 0.21/0.53 thf(c_0_40, plain, ![X1:nat]:(((lessis @ esk2_0 @ X1)|~((p @ X1)))), inference(spm,[status(thm)],[c_0_35, c_0_36])). 0.21/0.53 thf(c_0_41, negated_conjecture, (p @ esk1_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_15]), c_0_16])])). 0.21/0.53 thf(c_0_42, negated_conjecture, ((esk2_0)!=(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_15]), c_0_16])])). 0.21/0.53 thf(c_0_43, plain, ~((some @ (epred1_1 @ p))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_22]), c_0_41])]), c_0_42])). 0.21/0.53 thf(c_0_44, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_15]), c_0_16])]), ['proof']). 0.21/0.53 # SZS output end CNFRefutation 0.21/0.53 # Parsed axioms : 11 0.21/0.53 # Removed by relevancy pruning/SinE : 0 0.21/0.53 # Initial clauses : 19 0.21/0.53 # Removed in clause preprocessing : 6 0.21/0.53 # Initial clauses in saturation : 13 0.21/0.53 # Processed clauses : 60 0.21/0.53 # ...of these trivial : 2 0.21/0.53 # ...subsumed : 2 0.21/0.53 # ...remaining for further processing : 56 0.21/0.53 # Other redundant clauses eliminated : 0 0.21/0.53 # Clauses deleted for lack of memory : 0 0.21/0.53 # Backward-subsumed : 15 0.21/0.53 # Backward-rewritten : 7 0.21/0.53 # Generated clauses : 75 0.21/0.53 # ...of the previous two non-redundant : 70 0.21/0.53 # ...aggressively subsumed : 0 0.21/0.53 # Contextual simplify-reflections : 3 0.21/0.53 # Paramodulations : 61 0.21/0.53 # Factorizations : 0 0.21/0.53 # NegExts : 5 0.21/0.53 # Equation resolutions : 0 0.21/0.53 # Propositional unsat checks : 0 0.21/0.53 # Propositional check models : 0 0.21/0.53 # Propositional check unsatisfiable : 0 0.21/0.53 # Propositional clauses : 0 0.21/0.53 # Propositional clauses after purity: 0 0.21/0.53 # Propositional unsat core size : 0 0.21/0.53 # Propositional preprocessing time : 0.000 0.21/0.53 # Propositional encoding time : 0.000 0.21/0.53 # Propositional solver time : 0.000 0.21/0.53 # Success case prop preproc time : 0.000 0.21/0.53 # Success case prop encoding time : 0.000 0.21/0.53 # Success case prop solver time : 0.000 0.21/0.53 # Current number of processed clauses : 19 0.21/0.53 # Positive orientable unit clauses : 5 0.21/0.53 # Positive unorientable unit clauses: 0 0.21/0.53 # Negative unit clauses : 3 0.21/0.53 # Non-unit-clauses : 11 0.21/0.53 # Current number of unprocessed clauses: 33 0.21/0.53 # ...number of literals in the above : 122 0.21/0.53 # Current number of archived formulas : 0 0.21/0.53 # Current number of archived clauses : 37 0.21/0.53 # Clause-clause subsumption calls (NU) : 194 0.21/0.53 # Rec. Clause-clause subsumption calls : 139 0.21/0.53 # Non-unit clause-clause subsumptions : 11 0.21/0.53 # Unit Clause-clause subsumption calls : 17 0.21/0.53 # Rewrite failures with RHS unbound : 0 0.21/0.53 # BW rewrite match attempts : 4 0.21/0.53 # BW rewrite match successes : 4 0.21/0.53 # Condensation attempts : 60 0.21/0.53 # Condensation successes : 0 0.21/0.53 # Termbank termtop insertions : 4052 0.21/0.53 0.21/0.53 # ------------------------------------------------- 0.21/0.53 # User time : 0.005 s 0.21/0.53 # System time : 0.004 s 0.21/0.53 # Total time : 0.009 s 0.21/0.53 # Maximum resident set size: 1940 pages 0.21/0.53 0.21/0.53 # ------------------------------------------------- 0.21/0.53 # User time : 0.016 s 0.21/0.53 # System time : 0.013 s 0.21/0.53 # Total time : 0.029 s 0.21/0.53 # Maximum resident set size: 1732 pages 0.21/0.53 EOF